Graphs Whose Edge Set Can Be Partitioned into Maximum Matchings
نویسندگان
چکیده
منابع مشابه
Graphs whose edge set can be partitioned into maximum matchings
This article provides structural characterization of simple graphs whose edge-set can be partitioned into maximum matchings. We use Vizing’s classification of simple graphs based on edge chromatic index.
متن کاملOn Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings
The problem of establishing the number of perfect matchings necessary to cover the edge-set of a cubic bridgeless graph is strictly related to a famous conjecture of Berge and Fulkerson. In this paper we prove that deciding whether this number is at most 4 for a given cubic bridgeless graph is NP-complete. We also construct an infinite family F of snarks (cyclically 4-edge-connected cubic graph...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملOn disjoint matchings in cubic graphs: Maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs
We show that any 2−factor of a cubic graph can be extended to a maximum 3−edge-colorable subgraph. We also show that the sum of sizes of maximum 2− and 3−edge-colorable subgraphs of a cubic graph is at least twice of its number of vertices.
متن کاملMaximum induced matchings in graphs
We provide a formula for the number of edges of a maximum induced matching in a graph. As applications, we give some structural properties of (k + 1 )K2-free graphs, construct all 2K2-free graphs, and count the number of labeled 2K2-free connected bipartite graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ISRN Combinatorics
سال: 2013
ISSN: 2090-8911
DOI: 10.1155/2013/358527